A Dynamic Programming Heuristic for Optimizing Slot Sizes in a Warehouse
نویسندگان
چکیده
منابع مشابه
A Dynamic Programming Heuristic for Optimizing Slot Sizes in a Warehouse
There exist a number of mathematical problems in the literature concerning warehouse storage optimization. However, to the best of our knowledge the problem of finding optimal slot sizes in pallet rack system minimizing the occupied storage space is not studied. More precisely, the problem is to optimally choose k ofm pallet racks with pallets in a warehouse, find optimal slot sizes in pallet r...
متن کاملpassivity in waiting for godot and endgame: a psychoanalytic reading
this study intends to investigate samuel beckett’s waiting for godot and endgame under the lacanian psychoanalysis. it begins by explaining the most important concepts of lacanian psychoanalysis. the beckettian characters are studied regarding their state of unconscious, and not the state of consciousness as is common in most beckett studies. according to lacan, language plays the sole role in ...
Natural Heuristic Dynamic Programming for Dynamic Systems
Heuristic Dynamic Programming (HDP) is the simplest kind of Adaptive Critic 1]. It can be used to maximize or minimize any utility function, such as total energy or trajectory error, of a system over time in a noisy environment. In this article, we propose a new version of HDP, called NHDP (Natural Heuristic Dynamic Programming). This new version incorporates basic HDP algorithm with the follow...
متن کاملThe optimal warehouse capacity: A queuing-based fuzzy programming approach
Among the various existing models for the warehousing management, the simultaneous use of private and public warehouses is as the most well-known one. The purpose of this article is to develop a queuing theory-based model for determining the optimal capacity of private warehouse in order to minimize the total corresponding costs. In the proposed model, the available space and budget to create a...
متن کاملA dynamic programming approach for solving nonlinear knapsack problems
Nonlinear Knapsack Problems (NKP) are the alternative formulation for the multiple-choice knapsack problems. A powerful approach for solving NKP is dynamic programming which may obtain the global op-timal solution even in the case of discrete solution space for these problems. Despite the power of this solu-tion approach, it computationally performs very slowly when the solution space of the pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia Computer Science
سال: 2014
ISSN: 1877-0509
DOI: 10.1016/j.procs.2014.05.327